A modified Melzak procedure for computing node-weighted Steiner treesUNDERWOOD, A.Networks (New York, NY). 1996, Vol 27, Num 1, pp 73-79, issn 0028-3045Article

The k-Steiner ratio in the rectilinear planeBORCHERS, A; DU, D.-Z; BIAO GAO et al.Journal of algorithms (Print). 1998, Vol 29, Num 1, pp 1-17, issn 0196-6774Article

The sequential sum problem and performance bounds on the greedy algorithm for the on-line steiner problemMILLER, Zevi; PRITIKIN, Dan; PERKEL, Manley et al.Networks (New York, NY). 2005, Vol 45, Num 3, pp 143-164, issn 0028-3045, 22 p.Article

The Existence Problem for Steiner Networks in Strictly Convex DomainsFREIRE, Alexandre.Archive for rational mechanics and analysis. 2011, Vol 200, Num 2, pp 361-404, issn 0003-9527, 44 p.Article

On the full and bottleneck full Steiner tree problemsYEN HUNG CHEN; CHIN LUNG LU; CHUAN YI TANG et al.Lecture notes in computer science. 2003, pp 122-129, issn 0302-9743, isbn 3-540-40534-8, 8 p.Conference Paper

On the approximability of the steiner tree problemTHIMM, Martin.Lecture notes in computer science. 2001, pp 678-689, issn 0302-9743, isbn 3-540-42496-2Conference Paper

Vertex-distinguishing edge-colorings of 2-regular graphsWITTMANN, P.Discrete applied mathematics. 1997, Vol 79, Num 1-3, pp 265-277, issn 0166-218XArticle

A primal-dual approximation algorithm for the Steiner forest problemRAVI, R.Information processing letters. 1994, Vol 50, Num 4, pp 185-189, issn 0020-0190Article

Tree polytope on 2-treesMARGOT, F; PRODON, A; LIEBLING, T. M et al.Mathematical programming. 1994, Vol 63, Num 2, pp 183-191, issn 0025-5610Article

Algorithms for terminal steiner treesVIDUANI MARTINEZ, Fabio; COELHO DE PINA, José; SOARES, José et al.Lecture notes in computer science. 2005, pp 369-379, issn 0302-9743, isbn 3-540-28061-8, 11 p.Conference Paper

Approximating Steiner trees in graphs with restricted weightsHALLDORSSON, M. M; UENO, S; NAKAO, H et al.Networks (New York, NY). 1998, Vol 31, Num 4, pp 283-292, issn 0028-3045Article

Euclidean Steiner minimal trees with obstacles and Steiner visibility graphsWINTER, P.Discrete applied mathematics. 1993, Vol 47, Num 2, pp 187-206, issn 0166-218XConference Paper

Practical partitioning-based methods for the steiner problemPOLZIN, Tobias; VAHDATI DANESHMAND, Siavash.Lecture notes in computer science. 2006, pp 241-252, issn 0302-9743, isbn 3-540-34597-3, 1Vol, 12 p.Conference Paper

Parallel Delaunay refinement with off-centersSPIELMAN, Daniel A; TENG, Shang-Hua; ÜNGÖR, Alper et al.Lecture notes in computer science. 2004, pp 812-819, issn 0302-9743, isbn 3-540-22924-8, 8 p.Conference Paper

A novel analog layout synthesys toolLIHONG ZHANG; KLEINE, Ulrich.IEEE International Symposium on Circuits and Systems. 2004, pp 101-104, isbn 0-7803-8251-X, 4 p.Conference Paper

Preprocessing steiner problems from VLSI layoutUCHOA, Eduardo; DE ARAGAO, Marcus Poggi; RIBEIRO, Celso C et al.Networks (New York, NY). 2002, Vol 40, Num 1, pp 38-50, issn 0028-3045Article

The Gilbert Arborescence ProblemVOLZ, M. G; BRAZIL, M; RAS, C. J et al.Networks (New York, NY). 2013, Vol 61, Num 3, pp 238-247, issn 0028-3045, 10 p.Article

Construction of efficient communication sub-structures: Non-approximability results and polynomial sub-casesLAFOREST, Christian.Lecture notes in computer science. 2003, pp 903-910, issn 0302-9743, isbn 3-540-40788-X, 8 p.Conference Paper

The Steiner tree problem for terminals on the boundary of a rectilinear polygonCHENG, S.-W.Theoretical computer science. 2000, Vol 237, Num 1-2, pp 213-238, issn 0304-3975Article

Interconnection strategies for wireless access networksYANIKOMEROGLU, H; SOUSA, E. S.IEEE international symposium on personal indoor and mobile radio communications. 1997, pp 882-886, 3VolConference Paper

The Steiner number of a graphCHARTRAND, Gary; PING ZHANG.Discrete mathematics. 2002, Vol 242, Num 1-3, pp 41-54, issn 0012-365XArticle

On finding two-connected subgraphs in planar graphsPROVAN, J. S.Operations research letters. 1997, Vol 20, Num 2, pp 81-84, issn 0167-6377Article

Thirty-five-point rectilinear Steiner minimal trees in a daySALOWE, J. S; WARME, D. M.Networks (New York, NY). 1995, Vol 25, Num 2, pp 69-87, issn 0028-3045Article

The Steiner Ratio Conjecture of Gilbert-Pollak May Still Be OpenINNAMI, N; KIM, B. H; MASHIKO, Y et al.Algorithmica. 2010, Vol 57, Num 4, pp 869-872, issn 0178-4617, 4 p.Article

Random strongly regular graphs?CAMERON, Peter J.Discrete mathematics. 2003, Vol 273, Num 1-3, pp 103-114, issn 0012-365X, 12 p.Conference Paper